TSTP Solution File: SEV433^1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEV433^1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 09:45:12 EDT 2024

% Result   : Theorem 0.21s 0.39s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SEV433^1 : TPTP v8.1.2. Released v5.2.0.
% 0.13/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36  % Computer : n014.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri May  3 11:55:32 EDT 2024
% 0.21/0.36  % CPUTime    : 
% 0.21/0.36  % (29433)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38  % (29436)WARNING: value z3 for option sas not known
% 0.21/0.38  % (29435)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38  % (29437)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38  % (29434)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38  % (29438)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.38  % (29436)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.38  % (29439)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.38  % (29440)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.38  % (29440)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.38  % Exception at run slice level
% 0.21/0.38  User error: % Exception at run slice levelFinite model buillding is currently not compatible with polymorphism or higher-order constructs% Exception at run slice level
% 0.21/0.38  
% 0.21/0.38  
% 0.21/0.38  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructsUser error: 
% 0.21/0.38  Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.39  % (29440)First to succeed.
% 0.21/0.39  % (29440)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29433"
% 0.21/0.39  % (29440)Refutation found. Thanks to Tanya!
% 0.21/0.39  % SZS status Theorem for theBenchmark
% 0.21/0.39  % SZS output start Proof for theBenchmark
% 0.21/0.39  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.39  thf(func_def_0, type, f: $i > $o).
% 0.21/0.39  thf(func_def_7, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.21/0.39  thf(func_def_8, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.21/0.39  thf(func_def_9, type, vAND: $o > $o > $o).
% 0.21/0.39  thf(func_def_10, type, vOR: $o > $o > $o).
% 0.21/0.39  thf(func_def_11, type, vIMP: $o > $o > $o).
% 0.21/0.39  thf(func_def_12, type, vNOT: $o > $o).
% 0.21/0.39  thf(func_def_13, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.21/0.39  thf(f330,plain,(
% 0.21/0.39    $false),
% 0.21/0.39    inference(trivial_inequality_removal,[],[f329])).
% 0.21/0.39  thf(f329,plain,(
% 0.21/0.39    ($true = $false)),
% 0.21/0.39    inference(forward_demodulation,[],[f294,f181])).
% 0.21/0.39  thf(f181,plain,(
% 0.21/0.39    ($false = vAPP($i,$o,f,sK1))),
% 0.21/0.39    inference(unit_resulting_resolution,[],[f12,f10,f11,f159])).
% 0.21/0.39  thf(f159,plain,(
% 0.21/0.39    ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X1) | (X1 = X2) | (X0 = X2) | (vAPP($i,$o,f,X0) = $false)) )),
% 0.21/0.39    inference(trivial_inequality_removal,[],[f141])).
% 0.21/0.39  thf(f141,plain,(
% 0.21/0.39    ( ! [X2 : $i,X0 : $i,X1 : $i] : (($false != $false) | (X0 = X1) | (X1 = X2) | (X0 = X2) | (vAPP($i,$o,f,X0) = $false)) )),
% 0.21/0.39    inference(equality_factoring,[],[f101])).
% 0.21/0.39  thf(f101,plain,(
% 0.21/0.39    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((X1 = X2) | ($false = vAPP($i,$o,f,X2)) | (X0 = X1) | (X0 = X3) | ($false = vAPP($i,$o,f,X3))) )),
% 0.21/0.39    inference(trivial_inequality_removal,[],[f75])).
% 0.21/0.39  thf(f75,plain,(
% 0.21/0.39    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true = $false) | (X1 = X2) | ($false = vAPP($i,$o,f,X2)) | (X0 = X1) | (X0 = X3) | ($false = vAPP($i,$o,f,X3))) )),
% 0.21/0.39    inference(superposition,[],[f69,f15])).
% 0.21/0.39  thf(f15,plain,(
% 0.21/0.39    ( ! [X0 : $i,X1 : $i] : ((X0 = X1) | (vAPP($i,$o,f,X0) = $false) | (vAPP($i,$o,f,X1) = $false)) )),
% 0.21/0.39    inference(binary_proxy_clausification,[],[f13])).
% 0.21/0.39  thf(f13,plain,(
% 0.21/0.39    ( ! [X0 : $i,X1 : $i] : ((X0 = X1) | (vAPP($i,$o,f,X0) != vAPP($i,$o,f,X1))) )),
% 0.21/0.39    inference(cnf_transformation,[],[f7])).
% 0.21/0.39  thf(f7,plain,(
% 0.21/0.39    ! [X0,X1] : ((X0 = X1) | (vAPP($i,$o,f,X0) != vAPP($i,$o,f,X1)))),
% 0.21/0.39    inference(ennf_transformation,[],[f1])).
% 0.21/0.39  thf(f1,axiom,(
% 0.21/0.39    ! [X0,X1] : ((vAPP($i,$o,f,X0) = vAPP($i,$o,f,X1)) => (X0 = X1))),
% 0.21/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p',finj)).
% 0.21/0.39  thf(f69,plain,(
% 0.21/0.39    ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X1) | (vAPP($i,$o,f,X1) = $false) | (X0 = X2) | ($true = vAPP($i,$o,f,X2))) )),
% 0.21/0.39    inference(trivial_inequality_removal,[],[f48])).
% 0.21/0.39  thf(f48,plain,(
% 0.21/0.39    ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = $false) | (X0 = X1) | (vAPP($i,$o,f,X1) = $false) | (X0 = X2) | ($true = vAPP($i,$o,f,X2))) )),
% 0.21/0.39    inference(superposition,[],[f15,f14])).
% 0.21/0.39  thf(f14,plain,(
% 0.21/0.39    ( ! [X0 : $i,X1 : $i] : ((X0 = X1) | (vAPP($i,$o,f,X0) = $true) | (vAPP($i,$o,f,X1) = $true)) )),
% 0.21/0.39    inference(binary_proxy_clausification,[],[f13])).
% 0.21/0.39  thf(f11,plain,(
% 0.21/0.39    (sK0 != sK2)),
% 0.21/0.39    inference(cnf_transformation,[],[f9])).
% 0.21/0.39  thf(f9,plain,(
% 0.21/0.39    (sK1 != sK2) & (sK0 != sK2) & (sK0 != sK1)),
% 0.21/0.39    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8])).
% 0.21/0.39  thf(f8,plain,(
% 0.21/0.39    ? [X0,X1,X2] : ((X1 != X2) & (X0 != X2) & (X0 != X1)) => ((sK1 != sK2) & (sK0 != sK2) & (sK0 != sK1))),
% 0.21/0.39    introduced(choice_axiom,[])).
% 0.21/0.39  thf(f6,plain,(
% 0.21/0.39    ? [X0,X1,X2] : ((X1 != X2) & (X0 != X2) & (X0 != X1))),
% 0.21/0.39    inference(ennf_transformation,[],[f3])).
% 0.21/0.39  thf(f3,negated_conjecture,(
% 0.21/0.39    ~! [X0,X1,X2] : ((X1 = X2) | (X0 = X2) | (X0 = X1))),
% 0.21/0.39    inference(negated_conjecture,[],[f2])).
% 0.21/0.39  thf(f2,conjecture,(
% 0.21/0.39    ! [X0,X1,X2] : ((X1 = X2) | (X0 = X2) | (X0 = X1))),
% 0.21/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3)).
% 0.21/0.39  thf(f10,plain,(
% 0.21/0.39    (sK0 != sK1)),
% 0.21/0.39    inference(cnf_transformation,[],[f9])).
% 0.21/0.39  thf(f12,plain,(
% 0.21/0.39    (sK1 != sK2)),
% 0.21/0.39    inference(cnf_transformation,[],[f9])).
% 0.21/0.39  thf(f294,plain,(
% 0.21/0.39    ($true = vAPP($i,$o,f,sK1))),
% 0.21/0.39    inference(unit_resulting_resolution,[],[f12,f244])).
% 0.21/0.39  thf(f244,plain,(
% 0.21/0.39    ( ! [X0 : $i] : ((vAPP($i,$o,f,X0) = $true) | (sK2 = X0)) )),
% 0.21/0.39    inference(trivial_inequality_removal,[],[f231])).
% 0.21/0.39  thf(f231,plain,(
% 0.21/0.39    ( ! [X0 : $i] : (($true = $false) | (sK2 = X0) | (vAPP($i,$o,f,X0) = $true)) )),
% 0.21/0.39    inference(superposition,[],[f180,f14])).
% 0.21/0.39  thf(f180,plain,(
% 0.21/0.39    ($false = vAPP($i,$o,f,sK2))),
% 0.21/0.39    inference(unit_resulting_resolution,[],[f12,f11,f10,f159])).
% 0.21/0.39  % SZS output end Proof for theBenchmark
% 0.21/0.39  % (29440)------------------------------
% 0.21/0.39  % (29440)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.39  % (29440)Termination reason: Refutation
% 0.21/0.39  
% 0.21/0.39  % (29440)Memory used [KB]: 772
% 0.21/0.39  % (29440)Time elapsed: 0.013 s
% 0.21/0.39  % (29440)Instructions burned: 22 (million)
% 0.21/0.39  % (29433)Success in time 0.027 s
%------------------------------------------------------------------------------